package bTree.LeetCode;

public class 不同路径2 {
        public int uniquePathsWithObstacles(int[][] obstacleGrid) {
            int m = obstacleGrid.length;
            int n = obstacleGrid[0].length;
            int [][]dp=new int[m][n];
            if (obstacleGrid[m - 1][n - 1] == 1 || obstacleGrid[0][0] == 1) {
                return 0;
            }
            for (int i = 0; i < m; i++) {
                int grid = obstacleGrid[i][0];
                if (grid == 0) {
                    dp[i][0]=1;
                }else{
                    break;
                }
            }
            for (int i = 1; i < n; i++) {
                int grid = obstacleGrid[0][i];
                if (grid == 0) {
                    dp[0][i]=1;
                }else{
                    break;
                }
            }
            for(int i=1;i<m;i++){
                for(int j=1;j<n;j++){
                    if(obstacleGrid[i][j]==0){
                        dp[i][j]=dp[i-1][j]+dp[i][j-1];
                    }else {
                        dp[i][j]=0;
                    }
                }
            }
            return dp[m-1][n-1];
        }
    }
